翻訳と辞書 |
polygon triangulation : ウィキペディア英語版 | polygon triangulation In computational geometry, polygon triangulation is the decomposition of a polygonal area (simple polygon) P into a set of triangles,〔 Chapter 3: Polygon Triangulation: pp.45–61.〕 i.e., finding a set of triangles with pairwise non-intersecting interiors whose union is P. Triangulations may be viewed as special cases of planar straight-line graphs. When there are no holes or added points, triangulations form maximal outerplanar graphs. == Polygon triangulation without extra vertices ==
Over time a number of algorithms have been proposed to triangulate a polygon.
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「polygon triangulation」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|